منابع مشابه
Secure Set Membership Using 3 Sat ∗ ( Extended
A wide variety of powerful cryptographic tools have been built using RSA, Diffie-Hellman, and other similar assumptions as their basis. Computational security has been achieved relative to complexity assumptions about the computational difficulty of a variety of number theoretic problems. However, these problems are closely related, and it is likely that if any one of them turns out to be effic...
متن کاملAdaptive Set-Membership Reduced-Rank Least Squares Beamforming Algorithms
This paper presents a new adaptive algorithm for the linearly constrained minimum variance (LCMV) beamformer design. We incorporate the set-membership filtering (SMF) mechanism into the reduced-rank joint iterative optimization (JIO) scheme to develop a constrained recursive least squares (RLS) based algorithm called JIO-SM-RLS. The proposed algorithm inherits the positive features of reduced-r...
متن کاملAn Extended Set-valued Kalman Filter
Set-valued estimation offers a way to account for imprecise knowledge of the prior distribution of a Bayesian statistical inference problem. The set-valued Kalman filter, which propagates a set of conditional means corresponding to a convex set of conditional probability distributions of the state of a linear dynamic system, is a general solution for linear Gaussian dynamic systems. In this pap...
متن کاملA Family of Set-membership Affine Projection Adaptive Filter Algorithms
In this paper, we extend the set-membership (SM) adaptive filtering approach to the various affine projection (AP) adaptive filter algorithms to propose the computationally efficient algorithms. Based on this, the SM-APA, SM selective regressor APA (SM-SR-APA), SM dynamic selection APA (SM-DS-APA) and SM selective partial update APA (SM-SPU-APA) are established. The SM-SR-APA reduces complexity...
متن کاملSet - Membership Adaptive Equalization
This paper considers the problems of channel estimation and adaptive equalization in the novel framework of set-membership parameter estimation. Channel estimation using a class of set-membership identiication algorithms known as optimal bounding ellipsoid (OBE) algorithms and their extension to track time-varying channels are described. Simulation results show that the OBE channel estimators o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2010
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-010-0024-x